Comments on 'A structure-preserving method for the quaternion LU decomposition in quaternionic quantum theory' by Minghui Wang and Wenhao Ma

نویسنده

  • Stephen J. Sangwine
چکیده

Claims were made in an article by Wang and Ma in 2013 that they had devised an algorithm for the quaternion LU decomposition that was significantly faster than the LU decomposition implemented in the Quaternion Toolbox for Matlab (QTFM). These claims have been tested and found to be unsupported by Matlab code supplied to the author by Wang and Ma. The author’s tests are presented, and test code made available as supplementary material. It is found that not only is the QTFM code faster, but that Wang and Ma’s algorithm has run-time that scales with the square of the size of the matrix, whereas the algorithm in QTFM has run time approximately linear in matrix size. These findings are consistent with an inspection of the code.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

QTRU: quaternionic version of the NTRU public-key cryptosystems

In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...

متن کامل

Quaternionic Quantum Mechanics and Noncommutative Dynamics

In this talk I shall first make some brief remarks on quaternionic quantum mechanics, and then describe recent work with A.C. Millard in which we show that standard complex quantum field theory can arise as the statistical mechanics of an underlying noncommutative dynamics. In quaternionic quantum mechanics, the Dirac transition amplitudes 〈ψ|φ〉 are quaternion valued, that is, they have the for...

متن کامل

A fast structure-preserving method for computing the singular value decomposition of quaternion matrices

In this paper we propose a fast structure-preserving algorithm for computing the singular value decomposition of quaternion matrices. The algorithm is based on the structurepreserving bidiagonalization of the real counterpart for quaternion matrices by applying orthogonal JRS-symplectic matrices. The algorithm is efficient and numerically stable. 2014 Elsevier Inc. All rights reserved.

متن کامل

SILAR Sensitization as an Effective Method for Making Efficient Quantum Dot Sensitized Solar Cells

CdSe quantum dots were in situ deposited on various structures of TiO2 photoanode by successive ionic layer adsorption and reaction (SILAR). Various sensitized TiO2 structures were integrated as a photoanode in order to make quantum dot sensitized solar cells. High power conversion efficiency was obtained; 2.89 % (Voc=524 mV, Jsc=9.78 mA/cm2, FF=0.56) for the cells that sensitized by SILAR meth...

متن کامل

Quaternionic Matrices: Inversion and Determinant ∗

We discuss the Schur complement formula for quaternionic matrices, M , and give an efficient method to calculate the matrix inverse. We also introduce the functional D[M ] which extends to quaternionic matrices the non-negative number |det[M ]|. 1. Introduction. Much of the spectral theory of complex matrices does not extend to quaternion matrices without further modifications [1, 2, 3]. In par...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Physics Communications

دوره 188  شماره 

صفحات  -

تاریخ انتشار 2015